منابع مشابه
COntinuous tiMe comPUTations. Computations on the Reals.
We propose to contribute to understand computation theories for continuous time systems. This is motivated by • understanding algorithmic complexity of automatic verification procedures for continuous and hybrid systems; • understanding some new models of computations. New models of computations under study include analog electronics models, and some recent sensor and telecommunication networks...
متن کاملTime Bounded Frequency Computations
This disproves a conjecture of Kinber. (2) We give a transparent proof of a generalization of Kinber's result that there exist arbitrarily complex problems admitting a polynomial time frequency computation. Several corollaries provide more insight into the structure of the hierarchy of polynomial time frequency classes. (3) The relationships between polynomial time frequency classes and selecti...
متن کاملδ-Decidability over the Reals∗
Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any LF -sentence φ containing only bounded quantifiers, and any positive rational number δ, decides either “φ is true”, or “a δ-strengthening of φ is false”’. Under mild assumptions, for a C-computable signature F , the δ-decision problem for bounded Σk-sentences in LF resides in (Σ...
متن کاملThe Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to arity one. In order to find decidable fragments of this language, it is necessary to restrict the expressiveness of the arithmetic part. One possible path is t...
متن کاملTrading Determinism for Time in Space Bounded Computations
Savitch showed in 1970 that nondeterministic logspace (NL) is contained in deterministic O(log n) space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every problem in NL that requires polylogarithmic space and simultaneously runs in polynomial time was left open. In this paper we give a partial solution to this problem and show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 1992
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196792000244